Discrete mathematics

Results: 2210



#Item
991Sample-Optimal Fourier Sampling in Any Constant Dimension Piotr Indyk Michael Kapralov August 2, 2014

Sample-Optimal Fourier Sampling in Any Constant Dimension Piotr Indyk Michael Kapralov August 2, 2014

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2014-12-30 11:14:06
992Nearest Neighbor Search in high-dimensional spaces Alexandr Andoni (Princeton/CCI → MSR SVC) Barriers II August 30, 2010

Nearest Neighbor Search in high-dimensional spaces Alexandr Andoni (Princeton/CCI → MSR SVC) Barriers II August 30, 2010

Add to Reading List

Source URL: www.mit.edu

Language: English - Date: 2010-09-04 11:51:32
993Chennai Mathematical Institute MSc/PhD Computer Science Topics covered in entrance examination • Discrete Mathematics Sets and relations, elementary counting techiniques, pigeon hole principle, partial orders, • Elem

Chennai Mathematical Institute MSc/PhD Computer Science Topics covered in entrance examination • Discrete Mathematics Sets and relations, elementary counting techiniques, pigeon hole principle, partial orders, • Elem

Add to Reading List

Source URL: www.cmi.ac.in

Language: English - Date: 2010-03-23 06:34:16
994Some experiments investigating a possible L(1/4) algorithm for the discrete logarithm problem in algebraic curves Maike Massierer∗ LORIA, Campus Scientifique, BP 239, 54506 Vandœuvre-l`es-Nancy Cedex, France maike.mas

Some experiments investigating a possible L(1/4) algorithm for the discrete logarithm problem in algebraic curves Maike Massierer∗ LORIA, Campus Scientifique, BP 239, 54506 Vandœuvre-l`es-Nancy Cedex, France maike.mas

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-12-13 07:45:36
995Chapter 10 Number-Theoretic Primitives Number theory is a source of several computational problems that serve as primitives in the design of cryptographic schemes. Asymmetric cryptography in particular relies on these pr

Chapter 10 Number-Theoretic Primitives Number theory is a source of several computational problems that serve as primitives in the design of cryptographic schemes. Asymmetric cryptography in particular relies on these pr

Add to Reading List

Source URL: cseweb.ucsd.edu

Language: English - Date: 2009-09-20 23:35:30
996Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders Safuat Hamdy Bodo Möller

Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders Safuat Hamdy Bodo Möller

Add to Reading List

Source URL: www.bmoeller.de

Language: English - Date: 2006-01-02 00:23:19
997Efficient Evaluation of k -Range Nearest Neighbor Queries in Road Networks ∗ ∗ Jie

Efficient Evaluation of k -Range Nearest Neighbor Queries in Road Networks ∗ ∗ Jie

Add to Reading List

Source URL: www-users.cs.umn.edu

Language: English - Date: 2010-03-22 17:04:24
998Approximate Evaluation of Range Nearest Neighbor Queries with Quality Guarantee? Chi-Yin Chow1 , Mohamed F. Mokbel1 , Joe Naps1 , and Suman Nath2 1  Department of Computer Science and Engineering, University of Minnesota

Approximate Evaluation of Range Nearest Neighbor Queries with Quality Guarantee? Chi-Yin Chow1 , Mohamed F. Mokbel1 , Joe Naps1 , and Suman Nath2 1 Department of Computer Science and Engineering, University of Minnesota

Add to Reading List

Source URL: www-users.cs.umn.edu

Language: English - Date: 2009-09-29 10:22:42
999Recent	
  Developments	
  in	
  the	
   Sparse	
  Fourier	
  Transform	
   Piotr	
  Indyk	
   MIT	
   Joint	
  work	
  with	
  Fadel	
  Adib,	
  Badih	
  Ghazi,	
  Haitham	
  Hassanieh,	
  Michael	
  

Recent  Developments  in  the   Sparse  Fourier  Transform   Piotr  Indyk   MIT   Joint  work  with  Fadel  Adib,  Badih  Ghazi,  Haitham  Hassanieh,  Michael  

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2013-12-10 15:35:29
1000Random Walks on Discrete and Continuous Circles by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A

Random Walks on Discrete and Continuous Circles by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A

Add to Reading List

Source URL: probability.ca

Language: English - Date: 2006-10-04 20:52:17